On the Massive String Problem
نویسندگان
چکیده
In this paper, we discuss an efficient and effective index mechanism to support the matching of massive pattern strings in against a very long target string. It is very important to the next generation sequencing in the biological research. The main idea behind it is to construct an automaton over all the pattern strings, and search the automaton against a BWT-array L created for a target string s to locate all the occurrences of every pattern in s once for all. Experiments have been conducted, which show that our method for this problem is better than the existing approaches. Keywords—string matching; DNA sequences; automata; BWTtransformation
منابع مشابه
انتخاب کوچکترین ابر رشته در DNA با استفاده از الگوریتم ازدحام ذرّات
A DNA string can be supposed a very long string on alphabet with 4 letters. Numerous scientists attempt in decoding of this string. since this string is very long , a shorter section of it that have overlapping on each other will be decoded .There is no information for the right position of these sections on main DNA string. It seems that the shortest string (substring of the main DNA string) i...
متن کاملTHE PC-TAU METHOD ON THE SOLUTION OF A MODEL OF AN ISOLATED COSMIC STRING
In this paper, we adapt the operational Tau Method for personal computers and apply it to a system of two nonlinear second order ordinary differential equations which are related to general relativity. The interesting behaviour this problem exhibits in its numerical treatment is discussed. In this problem, we try to use the Tau perturbation term to locate the correct solution of this nonlin...
متن کاملUnstable Rotational States of Closed String with Massive Points
For the closed string carrying 2 or 3 point-like masses the stability problem for central and linear rotational states is considered. This problem is important for applications of these model to describing baryons, glueballs or other exotic hadrons. The linear rotational state correspond to an uniform rotation of the system with rectilinear string segments, connecting massive points. The state ...
متن کامل9 v 1 2 2 M ar 1 99 9 Initial - boundary value problem and stability of solutions for string baryon model “ triangle ”
For the string baryon model “triangle” the initial-boundary value problem is stated and solved in general. This problem implies defining a classical motion of the system on the base of given initial position and initial velocities of string points. The presented solution reduces the initial-boundary value problem for the considered model to the system of ordinary differential equations that can...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017